package leetcode;

public class Lc2264 {

    public String largestGoodInteger(String num) {
        String[] str = {"999", "888", "777", "666", "555", "444", "333", "222", "111", "000"};

        for (String temp : str) {
            if (num.contains(temp))
                return temp;
        }
        return "";
    }

}
